翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

typical set : ウィキペディア英語版
typical set
In information theory, the typical set is a set of sequences whose probability is close to two raised to the negative power of the entropy of their source distribution. That this set has total probability close to one is a consequence of the asymptotic equipartition property (AEP) which is a kind of law of large numbers. The notion of typicality is only concerned with the probability of a sequence and not the actual sequence itself.
This has great use in compression theory as it provides a theoretical means for compressing data, allowing us to represent any sequence ''X''''n'' using ''nH''(''X'') bits on average, and, hence, justifying the use of entropy as a measure of information from a source.
The AEP can also be proven for a large class of stationary ergodic processes, allowing typical set to be defined in more general cases.
==(Weakly) typical sequences (weak typicality, entropy typicality)==
If a sequence ''x''1, ..., ''x''''n'' is drawn from an i.i.d. distribution ''X'' defined over a finite alphabet \mathcal, then the typical set, ''A''''ε''(''n'')\in\mathcal(''n'') is defined as those sequences which satisfy:
:
2^ \leqslant p(x_1, x_2, \dots , x_n) \leqslant 2^

Where
: H(X) = - \sum_" TITLE="x^">\in A_\epsilon^ ) \geq 1 - \epsilon
#\left| ^ \right| \leqslant 2^
#\left| ^ \right| \geqslant (1-\varepsilon)2^
#Most sequences are not typical. If the distribution over \mathcal is not uniform, then the fraction of sequences that are typical is
::\frac|} \equiv \frac|}} = 2^ \rightarrow 0
::as ''n'' becomes very large, since H(X) < \log|\mathcal|.
For a general stochastic process with AEP, the (weakly) typical set can be defined similarly with ''p''(''x''1, ''x''2, ..., ''x''''n'') replaced by ''p''(''x''0''τ'') (i.e. the probability of the sample limited to the time interval ()), ''n'' being the degree of freedom of the process in the time interval and ''H''(''X'') being the entropy rate. If the process is continuous-valued, differential entropy is used instead.
Counter-intuitively, most likely sequence is often not a member of the typical set. For example, suppose that ''X'' is an i.i.d Bernoulli random variable with ''p''(0)=0.1 and ''p''(1)=0.9. In ''n'' independent trials, since ''p''(1)>''p''(0), the most likely sequence of outcome is the sequence of all 1's, (1,1,...,1). Here the entropy of ''X'' is ''H''(''X'')=0.469, while -\frac\log p(x^=(1,1,\ldots,1)) = -\frac\log (0.9^n) = 0.152
So this sequence is not in the typical set because its average logarithmic probability cannot come arbitrarily close to the entropy of the random variable ''X'' no matter how large we take the value of ''n''. For Bernoulli random variables, the typical set consists of sequences with average numbers of 0s and 1s in ''n'' independent trials. For this example, if ''n''=10, then the typical set consist of all sequences that has a single 0 in the entire sequence. In case ''p''(0)=''p''(1)=0.5, then every possible binary sequences belong to the typical set.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「typical set」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.